A greedy algorithm for pilot contamination mitigation using LAP

Abstract In this paper, we propose a linear assignment problem (LAP) scheme using greedy algorithms to alleviate the intercell interference (ICI) in massive multi-input multiple-output (maMIMO) systems. ICI has been recognized as one of main challenges MIMO systems and occurs when pilot sequences (PSs) are reused across neighboring cells or non-orthogonal PS, results phenomenon known contamination (PC). The proposed uniquely assigns mobile terminals mitigate PC such that optimal near-optimal solution is achieved. This attains maximum SINR by assigning sequence will only produce least PC. Results obtained from simulation showed achieved greater sum rate than some established schemes compared.